منابع مشابه
Error formulas for divided difference expansions and numerical differentiation
Here, and throughout the paper, we will assume that x0 ≤ x1 ≤ . . . ≤ xn are arbitrarily spaced real values and x is any real value in the interval [x0, xn]. We refer the reader to Conte and de Boor [1 ] for basic properties of divided differences. Two things are required: evaluation of the coefficients ck; and a bound on the remainder term Rp in terms of the maximum grid spacing h := max 0≤i≤n...
متن کاملPresentation, error analysis and numerical experiments on a group of 1-step-ahead numerical differentiation formulas
In order to achieve higher computational precision in approximating the first-order derivative of the target point, the 1-step-ahead numerical differentiation formulas are presented. These formulas greatly remedy some intrinsic weaknesses of the backward numerical differentiation formulas, and overcome the limitation of the central numerical differentiation formulas. In addition, a group of for...
متن کاملAcyclic Formulas and Minimal Unsatisfiability⋆
We call a boolean formula (in CNF) stable acyclic if the associated digraph is free of a certain type of cycles. We show that satisfiability and recognition are polynomial–time solvable problems for stable acyclic formulas. Further, we show that a minimal unsatisfiable formula is stable acyclic if and only if the number of clauses exceeds the number of variables exactly by one (this subclass of...
متن کاملMinimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
Seymour (Quart. J. Math. Oxford 25 (1974), 303-312) proved that a minimal non 2-colorable hypergraph on n vertices has at least n edges. A related fact is that a minimal unsatistiable CNF formula in n variables has at least n + 1 clauses (an unpublished result of M. Tarsi.) The link between the two results is shown; both are given infinite versions and proved using transversal theory (Seymour’s...
متن کاملConstruction of fully symmetric numerical integration formulas of fully symmetric numerical integration formulas
The paper develops a construction for finding fully symmetric integration formulas of arbitrary degree 2k + t in n-space such that the number of evaluation points is O ((2n)k/k t), n ~ . Formulas of degrees 3, 5, 7, 9, are relatively simple and are presented in detail. The method has been tested by obtaining some special formulas of degrees 7, 9 and 1 t but these are not presented here.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2018
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-018-0973-3